A Solution to the Invariant Subspace Problem

نویسنده

  • YUN-SU KIM
چکیده

An important open problem in operator theory is the invariant subspace problem. Since the problem is solved for all finite dimensional complex vector spaces of dimension at least 2, H denotes a separable Hilbert space whose dimension is infinite. It is enough to think for a contraction T , that is, ‖T‖ ≤ 1 on H . Thus, T ( 6= 0) denotes a contraction in L(H). Let λ always denote an element of the spectrum σ(T ) of T . If λ ∈ σ(T ) such that S = T − λIH is one-to-one, and has dense range, then S1(: Range(S) → H) always denotes a densely defined operator defined by S1(a) = S (a) for a in the range of S, where S(a) denotes an element such that S(S(a)) = a. Clearly, S1 is a linear mapping, and S1 is a densely defined operator in H . It is not assumed that S1 is bounded or continuous. If S = T−λIH is one-to-one, then clearly S is not onto. If S( 6= 0) does not have a dense range, then the closure of Range (S) is a non-trivial invariant subspace of S and so is of T . Thus, if S = T − λIH is one-to-one, then we always assume that S has a dense range. In the proof of Proposition 2.3, we show that S 1 is also densely defined. We provide sufficient conditions for the invariant subspace problem in Theorem 2.6 ;

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak*-closed invariant subspaces and ideals of semigroup algebras on foundation semigroups

Let S be a locally compact foundation semigroup with identity and                          be its semigroup algebra. Let X be a weak*-closed left translation invariant subspace of    In this paper, we prove that  X  is invariantly  complemented in   if and  only if  the left ideal  of    has a bounded approximate identity. We also prove that a foundation semigroup with identity S is left amenab...

متن کامل

An effective method for eigen-problem solution of fluid-structure systems

Efficient mode shape extraction of fluid-structure systems is of particular interest in engineering. An efficient modified version of unsymmetric Lanczos method is proposed in this paper. The original unsymmetric Lanczos method was applied to general form of unsymmetric matrices, while the proposed method is developed particularly for the fluid-structure matrices. The method provides us with si...

متن کامل

Low Rank Solution of Lyapunov Equations

This paper presents the Cholesky factor–alternating direction implicit (CF–ADI) algorithm, which generates a low rank approximation to the solution X of the Lyapunov equation AX + XAT = −BBT . The coefficient matrix A is assumed to be large, and the rank of the righthand side −BBT is assumed to be much smaller than the size of A. The CF–ADI algorithm requires only matrix-vector products and mat...

متن کامل

The Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach

In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...

متن کامل

The Basic Theorem and its Consequences

Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...

متن کامل

Image Classification via Sparse Representation and Subspace Alignment

Image representation is a crucial problem in image processing where there exist many low-level representations of image, i.e., SIFT, HOG and so on. But there is a missing link across low-level and high-level semantic representations. In fact, traditional machine learning approaches, e.g., non-negative matrix factorization, sparse representation and principle component analysis are employed to d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009